Inductive inference of logic programs based on algebraic semantics
نویسندگان
چکیده
منابع مشابه
Inductive Tight Semantics for Logic Programs
The Gelfond-Lifschitz operator fixed-point requirement by Stable Models induces asymmetry in dealing with Even Loops and Odd Loops Over Negation. We introduce a 2-valued semantics for Normal Logic Programs — the Inductive Tight semantics (ITS) — that generalizes SM semantics by dealing uniformly with Even and Odd loops.ITS conservatively extends the SM semantics (all SMs are Tight models), enjo...
متن کامل(a) Title of Paper Inductive Inference of Algebraic Processes Based on Hennessy- Milner Logic
This paper considers algebraic basic processes, a subset of communicating processes in CCS by Milner, and presents a synthesis algorithm to infer a process that satis es the properties of the process, represented as formulae in Hennessy-Milner Logic. The validity of the proposed algorithm can be stated that it synthesizes a process in the limit, which cannot be distinguished from the target one...
متن کاملInverse Narrowing for the Inductive Inference of Functional Logic Programs
We present a framework for the Induction of Functional Logic Programs (IFLP) from facts. This can be seen as an extension to the now consolidated field of Inductive Logic Programming (ILP). For that purpose we study the reversal of narrowing, the more usual operational mechanism for Functional Logic Programming. Also we fix the goal and heuristics in consilient programs rather than look for the...
متن کاملLogic-Based Inductive Synthesis of Efficient Programs
Inductive programming approaches typically rely on an Occamist bias to select hypotheses with minimal textual complexity. This approach, however, fails to distinguish between the efficiencies of hypothesised programs, such as merge sort (O(n log n)) and bubble sort (O(n2)). We address this issue by introducing techniques to learn logic programs with minimal resource complexity. We describe an a...
متن کاملAlgebraic Logic : Referential Algebraic Semantics
Wójcicki has provided a characterization of selfextensional logics as those that can be endowed with a complete local referential semantics. His result was extended by Jansana and Palmigiano, who developed a duality between the category of reduced congruential atlases and that of reduced referential algebras over a fixed similarity type. This duality restricts to one between reduced atlas model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Generation Computing
سال: 1990
ISSN: 0288-3635,1882-7055
DOI: 10.1007/bf03037452